Solving Muller Games via Safety Games
نویسندگان
چکیده
We show how to transform a Muller game with n vertices into a safety game with (n!) vertices whose solution allows to determine the winning regions of the Muller game and a winning strategy for one player.
منابع مشابه
Down the Borel hierarchy: Solving Muller games via safety games
We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies for Muller games. Moreover, we generalize our construction by presenting a new ...
متن کاملSolving infinite games with bounds
We investigate the existence and the complexity of computing and implementing optimal winning strategies for graph games of infinite duration. Parameterized linear temporal logics are extensions of Linear Temporal Logic (LTL) by temporal operators equipped with variables for time bounds. In model-checking, such specifications were introduced as “PLTL” by Alur et al. and as “PROMPT-LTL” by Kupfe...
متن کاملWhat kind of memory is needed to win infinitary Muller games?
In an influential paper entitled “How much memory is needed to win infinite games”, Dziembowski, Jurdziński, and Walukiewicz have shown that there are Muller games of size O(n) whose winning strategies require memory of size at least n!. This shows that the LAR-memory, based on the latest appearance records introduced by Gurevich and Harrington, is optimal for solving Muller games. We review th...
متن کاملWhat kind of memory is needed to win infinitary
In an influential paper entitled “How much memory is needed to win infinite games”, Dziembowski, Jurdziński, and Walukiewicz have shown that there are Muller games of size O(n) whose winning strategies require memory of size at least n!. This shows that the LAR-memory, based on the latest appearance records introduced by Gurevich and Harrington, is optimal for solving Muller games. We review th...
متن کاملQuantitative Reductions and Vertex-Ranked Infinite Games
We introduce quantitative reductions, a novel technique for solving quantitative games that does not rely on a reduction to qualitative games. We demonstrate that such reductions exhibit the same desirable properties as qualitative ones. In addition, they retain the optimality of solutions. As a general-purpose target for quantitative reductions, we introduce vertex-ranked games, in which the v...
متن کامل